A circuit-preserving mapping from multilevel to Boolean dynamics
نویسندگان
چکیده
منابع مشابه
A circuit-preserving mapping from multilevel to Boolean dynamics.
Many discrete models of biological networks rely exclusively on Boolean variables and many tools and theorems are available for analysis of strictly Boolean models. However, multilevel variables are often required to account for threshold effects, in which knowledge of the Boolean case does not generalise straightforwardly. This motivated the development of conversion methods for multilevel to ...
متن کاملMapping multivalued onto Boolean dynamics.
This paper deals with the generalized logical framework defined by René Thomas in the 70's to qualitatively represent the dynamics of regulatory networks. In this formalism, a regulatory network is represented as a graph, where nodes denote regulatory components (basically genes) and edges denote regulations between these components. Discrete variables are associated to regulatory components ac...
متن کامل1 Positive or negative regulatory circuit inference from multilevel dynamics
In the course of his work on the analysis of genetic regulatory networks represented by signed directed graphs, R. Thomas has proposed that the occurrence of a positive regulatory circuit is a necessary condition for the occurrence of multiple stable states, whereas a negative circuit is necessary to generate stable oscillations. Here, we enunciate and demonstrate one theorem establishing these...
متن کاملBoolean Circuit Lower Bounds
The lectures are devoted to boolean circuit lower bounds. We consider circuits with gates ∧,∨,¬. Suppose L ∈ {0, 1}∗ is a language. Let Ln = L∩{0, 1}. We say that L is computed by a family of circuits C1, C2, . . . if on an input x = (x1, . . . , xn), Cn(x) is 1 when x ∈ Ln and is 0 when x / ∈ Ln. For a circuit C, we define size(C) to be the number of edges in the graph representing C, and dept...
متن کاملMultilevel Circuit Partitioning1
Recent work [2] [5] [11] [12] [14] has illustrated the promise of multilevel approaches for partitioning large circuits. Multilevel partitioning recursively clusters the instance until its size is smaller than a given threshold, then unclusters the instance while applying a partitioning refinement algorithm. Our multilevel partitioner uses a new technique to control the number of levels in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Biology
سال: 2018
ISSN: 0022-5193
DOI: 10.1016/j.jtbi.2017.12.013